Linear cellular automata with boundary conditions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Elementary Cellular Automata Boundary Conditions

We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fixed and variable boundaries are attempted. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA) are analyzed and compared. The results show superior randomness features and the output strin...

متن کامل

Reversibility of general 1D linear cellular automata over the binary field Z2 under null boundary conditions

The reversibility of cellular automata(CA) has long been studied but there are still many problems untouched. This paper tackles the reversibility problem of the general case concerning 1D CA under null boundary conditions defined by linear rules over the binary field Z2. Although transition matrix has been widely used for some special linear CA(LCA) rules, it has severe limitations: its comple...

متن کامل

Feedback Shift Registers as Cellular Automata Boundary Conditions

We present a new design for random number generation. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA). The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design is good candidate for parallel random number g...

متن کامل

Linear Cellular Automata

6 The calculus of regular expressions 75 6.1 Derivatives

متن کامل

Quasi-Linear Cellular Automata

Simulating a cellular automaton (CA) for t time-steps into the future requires t serial computation steps or t parallel ones. However, certain CAs based on an Abelian group, such as addition mod 2, are termed linear because they obey a principle of superposition. This allows them to be predicted efficiently, in serial time O(t) or O(log t) in parallel. In this paper, we generalize this by looki...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2001

ISSN: 0024-3795

DOI: 10.1016/s0024-3795(00)00227-5